Matrices Diagonally Similar to a Symmetric Matrix
نویسندگان
چکیده
Let IF be field, and let A and B be n X n matrices with elements in IF. Suppose that A is completely reducible and that B is symmetric. If the principal minors of A determined by the 1and 2-circuits of the graph of B and by the chordless circuits of the graph of A are equal to the corresponding principal minors of B, then A is diagonally similar to B; and conversely.
منابع مشابه
On Lyapunov Scaling Factors of Real Symmetric Matrices
A real square matrix A is said to be Lyapunov diagonally semistable if there exists a positive definite diagonal matrix D, called a Lyapunov scaling factor of A, such that the matrix AD + DAT is positive semidefinite, Lyapunov diagonally semistable matrices play an important role in applications in several disciplines, and have been studied in many matrix theoretical papers, see for example [2]...
متن کاملOn Factor Width and Symmetric H-matrices
We define a matrix concept we call factor width. This gives a hierarchy of matrix classes for symmetric positive semidefinite matrices, or a set of nested cones. We prove that the set of symmetric matrices with factor width at most two is exactly the class of (possibly singular) symmetric H-matrices (also known as generalized diagonally dominant matrices) with positive diagonals, H+. We prove b...
متن کاملInverses of symmetric, diagonally dominant positive matrices and applications
We prove tight bounds for the ∞-norm of the inverse of a symmetric, diagonally dominant positive matrix J ; in particular, we show that ‖J‖∞ is uniquely maximized among all such J . We also prove a new lower-bound form of Hadamard’s inequality for the determinant of diagonally dominant positive matrices and an improved upper bound for diagonally balanced positive matrices. Applications of our r...
متن کاملTight bounds on the infinity norm of inverses of symmetric diagonally dominant positive matrices
We prove tight bounds for the ∞-norm of the inverse of symmetric diagonally dominant positive matrices. Applications include numerical stability for linear systems, bounds on inverses of differentiable functions, and the consistency of maximum entropy graph distributions from single samples.
متن کاملComputing the log-determinant of symmetric, diagonally dominant matrices in near-linear time
We present new algorithms for computing the log-determinant of symmetric, diagonally dominant matrices. Existing algorithms run with cubic complexity with respect to the size of the matrix in the worst case. Our algorithm computes an approximation of the log-determinant in time near-linear with respect to the number of non-zero entries and with high probability. This algorithm builds upon the u...
متن کامل